#include<bits/stdc++.h>

using namespace std;
const int maxn = 100000;
int Q[maxn], head = maxn >> 1, tail = head - 1;//简单的双端队列

int main() {

    return 0;
}